Entity Clustering Using 3D Mesh Simplification

نویسندگان

  • Costin-Anton Boiangiu
  • Bogdan Raducanu
چکیده

Entity clustering is a vital feature needed by any automatic content conversion system. Such a system constructs a digital document from a hard copy of a newspaper, book, etc. At application level, the system will process an image (typically black and white) and identify the various content layout elements, such as paragraphs, tables, images, columns, etc. Here is where the entity clustering mechanism comes into play. Its role is to group atomic entities (characters, points, lines) into layout elements. To achieve this, the system can take on different approaches. They mostly rely on the geometrical properties of the enclosed items, like their relative position, size, boundaries or alignment. This paper describes an approach based on 3D mesh reduction algorithms. Key-Words: automatic content conversion, document digitization, layout identification, entity clustering, mesh reduction, heightmaps, terrain, level of detail

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3D Mesh Coarsening via Uniform Clustering

In this paper, we present a fast and efficient mesh coarsening algorithm for 3D triangular meshes. Theis approach can be applied to very complex 3D meshes of arbitrary topology and with millions of vertices. The algorithm is based on the clustering of the input mesh elements, which divides the faces of an input mesh into a given number of clusters for clustering purpose by approximating the Cen...

متن کامل

Markov Random Fields for Improving 3D Mesh Analysis and Segmentation

Mesh analysis and clustering have became important issues in order to improve the efficiency of common processing operations like compression, watermarking or simplification. In this context we present a new method for clustering / labeling a 3D mesh given any field of scalar values associated with its vertices (curvature, density, roughness etc.). Our algorithm is based on Markov Random Fields...

متن کامل

3d Face Correspondence Based on Uniform Mesh Resampling Combined with Mesh Simplification

This present study, proposes a new 3D face correspondence method. A uniform mesh re-sampling algorithm is combined with mesh simplification algorithm to make correspondence between vertices of prototypical 3D faces. Uniform mesh re-sampling algorithm is developed to obtain the same topology between 3D faces with different structures. A global error metrics is proposed and mesh simplification is...

متن کامل

Point-based Simplification Algorithm

This study presents a novel, rapid, and effective point simplification algorithm based on a point cloud without any normal and connectivity information. This study is initiated with a scattered sampled point set in three dimensions, and the final output is a triangular mesh model, which is simplified according to a restrictive criteria. The proposed method reduces the number of calculations req...

متن کامل

Mesh simplification using ellipsoidal schema for isotropic quantization of face-normal vectors

In this paper, we present a method for simplification of arbitrary 3D meshes that is based on Isotropic Quantization of face-normal vectors. There are three stages. Firstly, a codebook that contains the unique face-normal vectors of the 3D mesh is generated using our Ellipsoidal Schema. Secondly, the polygons of the mesh are grouped into patches: based on the codebook vectors and the locality i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008